n, c = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
score = 0
sum = 0
for i in range(n):
sum += t[i]
score += max(0, (p[i]-(sum*c)))
summ = 0
scoree = 0
for i in range(n-1, -1, -1):
summ += t[i]
scoree += max(0, (p[i]-(summ*c)))
if(scoree>score):
print("Radewoosh")
elif(score==scoree):
print("Tie")
else:
print("Limak")
796A - Buying A House | 67A - Partial Teacher |
116A - Tram | 1472B - Fair Division |
1281C - Cut and Paste | 141A - Amusing Joke |
112A - Petya and Strings | 677A - Vanya and Fence |
1621A - Stable Arrangement of Rooks | 472A - Design Tutorial Learn from Math |
1368A - C+= | 450A - Jzzhu and Children |
546A - Soldier and Bananas | 32B - Borze |
1651B - Prove Him Wrong | 381A - Sereja and Dima |
41A - Translation | 1559A - Mocha and Math |
832A - Sasha and Sticks | 292B - Network Topology |
1339A - Filling Diamonds | 910A - The Way to Home |
617A - Elephant | 48A - Rock-paper-scissors |
294A - Shaass and Oskols | 1213A - Chips Moving |
490A - Team Olympiad | 233A - Perfect Permutation |
1360A - Minimal Square | 467A - George and Accommodation |